Efficient Double-Precision Cosine Generation
نویسندگان
چکیده
The trigonometric function of cos(θ) plays an important role in communication systems, digital signal processing systems, and graphical systems. This paper presents a technique for generating the cosine of an angle that is more computationally efficient than the CORDIC algorithm and its many variants for double-precision floating point calculations. A hardware design implementation of the cosine generator has been developed. Simulation results for an Altera Stratix II FPGA implementation indicate that the hardware design is both more efficient and more precise than previous published implementations.
منابع مشابه
Vi-1 Vi. Suffix Dictionaries
Cosine Numeric Abstract, Cosine Logical Abstract, Overlap Logical Overlap Logical Abstract, Cosine Numeric Cosine Numeric Text, Cosine Numeric Text, Cosine Logical Text, Overlap Logical Abstract, Cosine Numeric Cosine Numeric Abstract, Cosine Logical Cosine Logical Title, Cosine Numeric EVALUATION MEASURE Normed. Recall Normed. Precision Normed. Recall Normed. Precision Normed. Recall Normed. P...
متن کاملColor and Edge Directive Descriptor Feature Extraction Technique for Content Based Image Retrieval System
The development of multimedia technology in Content Based Image Retrieval (CBIR) System is one of the prominent area to retrieve the images from a large collection of database. It is practically observed that any one algorithm is not efficient in extracting all different types of natural images. Hence a thorough analysis of certain color, texture and edge extraction techniques are carried out t...
متن کاملEfficient Document Indexing Using Pivot Tree
We present a novel method for efficiently searching top-k neighbors for documents represented in high dimensional space of terms based on the cosine similarity. Mostly, documents are stored as bagof-words tf-idf representation. One of the most used ways of computing similarity between a pair of documents is cosine similarity between the vector representations, but cosine similarity is not a met...
متن کاملEfficient Prime Factor Algorithm and Address Generation Techniques for the Discrete Cosine Transform
This brief proposes an efficient prime factor algorithm for the discrete cosine transform. In the proposal, we formulate the decomposition directly, by using the proposed input and output mapping, a novel in-place address generation scheme for input index mapping is derived, while the formulations in the literature require a table to store the index mapping. Besides, our approach requires one o...
متن کاملLaplace-Fourier Transform of the Stretched Exponential Function: Analytic Error Bounds, Double Exponential Transform, and Open-Source Implementation "libkww"
The C library libkww provides functions to compute the Kohlrausch–Williams– Watts function, i.e., the Laplace–Fourier transform of the stretched (or compressed) exponential function exp(−t) for exponents β between 0.1 and 1.9 with double precision. Analytic error bounds are derived for the low and high frequency series expansions. For intermediate frequencies, the numeric integration is enormou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005